Gauss Phrases Realizable by Classical Links
نویسنده
چکیده
A classical link in 3-space can be represented by a Gauss phrase encoding a plane diagram of the link in a purely combinatorial way. A Gauss phrase may give rise not to a classical link, but to a diagram with virtual crossings. We describe a linear algorithm determining whether a Gauss phrase encodes a classical link. We characterize Wirtinger presentations realizable by virtual link groups.
منابع مشابه
Gauss Paragraphs of Classical Links and a Characterization of Virtual Link Groups
A classical link in 3-space can be represented by a Gauss paragraph encoding a link diagram in a combinatorial way. A Gauss paragraph may code not a classical link diagram, but a diagram with virtual crossings. We present a criterion and a linear algorithm detecting whether a Gauss paragraph encodes a classical link. We describe Wirtinger presentations realizable by virtual link groups.
متن کاملA hybrid mean value involving a new Gauss sums and Dedekind sums
In this paper, we introduce a new sum analogous to Gauss sum, then we use the properties of the classical Gauss sums and analytic method to study the hybrid mean value problem involving this new sums and Dedekind sums, and give an interesting identity for it.
متن کاملOn Free Knots and Links
Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister moves, we get a dramatic simplification of virtual knots, which kills all classical knots. However, many virtual knots survive after this simplification. We ...
متن کاملOn the realization of double occurrence words
Let S be a double occurrence word, and let MS be the word’s interlacement matrix, regarded as a matrix over GF (2). Gauss addressed the question of which double occurrence words are realizable by generic closed curves in the plane. We reformulate answers given by Rosenstiehl and by de Fraysseix and Ossona de Mendez to give new graph-theoretic and algebraic characterizations of realizable words....
متن کاملChord Diagrams and Gauss Codes for Graphs
Chord diagrams on circles and their intersection graphs (also known as circle graphs) have been intensively studied, and have many applications to the study of knots and knot invariants, among others. However, chord diagrams on more general graphs have not been studied, and are potentially equally valuable in the study of spatial graphs. We will define chord diagrams for planar embeddings of pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006